Sign optimization and complex saddle points in one-dimensional QCD
نویسندگان
چکیده
We study one-dimensional QCD at finite quark density by using the sign optimization framework. The fermion problem is mitigated deforming path integral domain, $SU(3)$ to a complexified one ${\cal M} \subset SL(3)$, explicitly constructed reduce phase fluctuations. complexification angular representation of $SU(3)$. provide physical explanation procedure in terms complex saddle points. This picture connects framework generalized Lefschetz thimbles.
منابع مشابه
Saddle Points
To compute the maximum likelihood estimates the log-likelihood function L is maximized with respect to all model parameters. To check that the maximization has been achieved two things have to be satisfied: 1. The vector of first derivatives with respect to the model parameter L′ should be equal to 0. 2. The negative of the matrix of the second derivatives −L′′ should be a positive definite mat...
متن کاملMountain Passes and Saddle Points
Variational methods find solutions of equations by considering a solution as a critical point of an appropriately chosen function. Local minima and maxima are well-known types of critical points. We explore methods for finding critical points that are neither local maxima or minima, but instead are mountain passes or saddle points. Criteria for the existence of minima or maxima are well-known, ...
متن کاملApproximate Saddle Points Portfolios
We introduce the concept of saddle points portfolio and we establish a connection between this concept and the approximate minima.
متن کاملeconomic optimization and energy consumption in tray dryers
دراین پروژه به بررسی مدل سازی خشک کردن مواد غذایی با استفاده از هوای خشک در خشک کن آزمایشگاهی نوع سینی دار پرداخته شده است. برای آنالیز انتقال رطوبت در طی خشک شدن به طریق جابجایی، یک مدل لایه نازک برای انتقال رطوبت، مبتنی بر معادله نفوذ فیک در نظر گفته شده است که شامل انتقال همزمان جرم و انرژی بین فاز جامد و گاز می باشد. پروفایل دما و رطوبت برای سه نوع ماده غذایی شامل سیب زمینی، سیب و موز در طی...
15 صفحه اولSaddle Points and Pareto Points in Multiple Objective Programming
In this paper relationships between Pareto points and saddle points in multiple objective programming are investigated. Convex and nonconvex problems are considered and the equivalence between Pareto points and saddle points is proved in both cases. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. Partitions of the ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physrevd.106.l091503